Weighted Reed–Solomon convolutional codes
نویسندگان
چکیده
In this paper we present a concrete algebraic construction of novel class convolutional codes. These codes are built upon generalized Vandermonde matrices and therefore can be seen as natural extension Reed-Solomon block to the context For reason call them weighted (WRS) We show that under some constraints on defining parameters these Maximum Distance Profile (MDP), which means they have maximal possible growth in their column distance profile. study size field needed obtain WRS MDP compare it with existing general constructions literature, showing many cases require significantly smaller fields.
منابع مشابه
New convolutional codes from old convolutional codes
In this paper, starting with a family of convolutional codes, we construct a new convolutional code and we introduce also necessary and sufficient conditions in order that the new convolutional code is MDS.
متن کاملConvolutional Codes
The difference between block codes and convolutional codes is the encoding principle. In the block codes, the information bits are followed by the parity bits. In convolutional codes the information bits are spread along the sequence. That means that the convolutional codes map information to code bits not block wise, but sequentially convolve the sequence of information bits according to some ...
متن کاملconvolutional cylinder-type block-circulant cycle codes
in this paper, we consider a class of column-weight two quasi-cyclic low-density paritycheck codes in which the girth can be large enough, as an arbitrary multiple of 8. then we devote a convolutional form to these codes, such that their generator matrix can be obtained by elementary row and column operations on the parity-check matrix. finally, we show that the free distance of the convolution...
متن کاملComplete MDP convolutional codes
Maximum distance profile (MDP) convolutional codes have the property that their column distances are as large as possible. It has been shown that, transmitting over an erasure channel, these codes have optimal recovery rate for windows of a certain length. Reverse MDP convolutional codes have the additional advantage that they are suitable for forward and backward decoding algorithms. Beyond th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear & Multilinear Algebra
سال: 2023
ISSN: ['0308-1087', '1026-7573', '1563-5139']
DOI: https://doi.org/10.1080/03081087.2023.2169232